Propositions-as-types and shared state

نویسندگان

چکیده

We develop a principled integration of shared mutable state into proposition-as-types linear logic interpretation session-based concurrent programming language. While the foundation type systems for functional core languages often builds on correspondence, automatically ensuring strong safety and liveness properties, imperative features have mostly been handled by extra-logical constructions. Our system crucially nondeterminism sharing, inspired logical rules differential logic, ensures session fidelity, progress, confluence normalisation, while being able to handle first-class shareable reference cells storing any persistent object. also show how preservation and, perhaps surprisingly, resiliently survive in natural extension our language with locks. illustrate expressiveness examples highlighting detailed features, up simple ADTs.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Propositions as Types

Image factorizations in regular categories are stable under pullbacks, so they model a natural modal operator in dependent type theory. This unary type constructor [A] has turned up previously in a syntactic form as a way of erasing computational content, and formalizing a notion of proof irrelevance. Indeed, semantically, the notion of a support is sometimes used as surrogate proposition asser...

متن کامل

Signatures + Propositions Used as Types ?

Languages that distinguish between types and structures use explicit components for the carrier type(s) in structures. Examples are the functional language Standard ML and most algebraic speciication systems. Hence, they have to use general sum types or signatures to give types to structures and to be able to build, for instance, the algebraic hierarchy. Furthermore, in most languages the model...

متن کامل

Speci cation Structures and Propositions - as - Types

Many diierent notions of \property of interest" and methods of verifying such properties arise naturally in programming. A general framework of \Speciication Structures" is presented for combining diierent notions and methods in a coherent fashion. This is then applied to concurrency in the setting of Interaction Categories. As an example, we present a type system for concurrent processes stron...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ACM on programming languages

سال: 2021

ISSN: ['2475-1421']

DOI: https://doi.org/10.1145/3473584